Prime Two-dimensional Orders and Perpendicular Total Orders
نویسندگان
چکیده
منابع مشابه
Orders Modulo A Prime
In this article I develop the notion of the order of an element modulo n, and use it to prove the famous n 2 + 1 lemma as well as a generalization to arbitrary cyclotomic polynomials. References used in preparing this article are included in the last page. §1 Introduction I might as well state one of the main results of this article up front, so the following discussion seems a little more moti...
متن کاملNoetherian semigroup algebras and prime maximal orders
Let S be a semigroup and K be a field. A K-space K[S], with basis S and with multiplication extending, in a natural way, the operation on S, is called a semigroup algebra. It remains an open problem to characterize semigroup algebras that are a prime Noetherian maximal order. In this thesis, we give an answer to the problem for a large class of cancellative semigroups and we illustrate these re...
متن کاملOptimized Integral Controller Searching Prime Number Orders
The concept of integration is generally applicable to automatic control of processes. As shown in this paper, integral controller performs efficient searches in the extensive prime sets, too. An inspiration by the simple analytic rules for PID controller tuning results in integral controller that ensures predictable work regardless of the cardinality of primes. It gives an innovative applicatio...
متن کاملLearning Binary Relations and Total Orders
We study the problem of learning a binary relation between two sets of objects or between a set and itself We represent a binary relation between a set of size n and a set of size m as an n m matrix of bits whose i j entry is if and only if the relation holds between the corresponding elements of the two sets We present polynomial prediction algorithms for learning binary relations in an extend...
متن کاملOn-line chain partitioning of up-growing orders: The case of 2-dimensional orders and semi-orders
We analyze special cases of the on-line chain partition problem of up-growing orders. One result is a lower bound for 2-dimensional orders. Together with the old upper bound this yields the precise value of this game which is ` w+1 2 ́ as usual w is the width of the order. Our main contribution is the analysis of the game for semi-orders. Surprisingly the golden ratio comes into play, the precis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1998
ISSN: 0195-6698
DOI: 10.1006/eujc.1998.0214